Matching Connection Pairs
نویسندگان
چکیده
When an intruder launches attack not from their own computer but from intermediate hosts that they previously compromised, these intermediate hosts are called stepping-stones. In this paper, we describe an algorithm to be able to detect stepping-stones in detoured attacks. Our aim is to develop an algorithm that can trace an origin system which attacks a victim system via stepping-stones. There are two kinds of traceback technologies: IP packet traceback and connection traceback. We focused on connection traceback in this paper and proposed a new intruder tracing algorithm to distinguish between an origin system of attack and stepping-stones using process structures of operating systems.
منابع مشابه
Electronic band structure of a Carbon nanotube superlattice
By employing the theoretical method based on tight-binding, we study electronic band structure of single-wall carbon nanotube (CNT) superlattices, which the system is the made of the junction between the zigzag and armchair carbon nanotubes. Exactly at the place of connection, it is appeared the pentagon–heptagon pairs as topological defect in carbon hexagonal network. The calculations are base...
متن کاملElectronic band structure of a Carbon nanotube superlattice
By employing the theoretical method based on tight-binding, we study electronic band structure of single-wall carbon nanotube (CNT) superlattices, which the system is the made of the junction between the zigzag and armchair carbon nanotubes. Exactly at the place of connection, it is appeared the pentagon–heptagon pairs as topological defect in carbon hexagonal network. The calculations are base...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملMatchings and Partial Patterns
A matching of size 2n is a partition of the set [2n] = {1, 2, . . . , 2n} into n disjoint pairs. A matching may be identified with a canonical sequence, which is a sequence of integers in which each integer i ∈ [n] occurs exactly twice, and the first occurrence of i precedes the first occurrence of i+ 1. A partial pattern with k symbols is a sequence of integers from the set [k], in which each ...
متن کاملUsing Generalized Language Model for Question Matching
Question and answering service is one of the popular services in the World Wide Web. The main goal of these services is to finding the best answer for user's input question as quick as possible. In order to achieve this aim, most of these use new techniques foe question matching. . We have a lot of question and answering services in Persian web, so it seems that developing a question matching m...
متن کامل